Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
a(d(x)) |
→ d(c(b(a(x)))) |
| 2: |
|
b(c(x)) |
→ c(d(a(b(x)))) |
| 3: |
|
a(c(x)) |
→ x |
| 4: |
|
b(d(x)) |
→ x |
|
There are 4 dependency pairs:
|
| 5: |
|
A(d(x)) |
→ B(a(x)) |
| 6: |
|
A(d(x)) |
→ A(x) |
| 7: |
|
B(c(x)) |
→ A(b(x)) |
| 8: |
|
B(c(x)) |
→ B(x) |
|
Consider the SCC {5-8}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 4, 2006